An Algebraic Construction of Predicate Transformers
نویسندگان
چکیده
In this paper we present an algebraic construction of monotonic predicate transformers, using a categorical construction which is similar to the algebraic construction of the integers from the natural numbers. When applied to the category of sets and total functions once, it yields a category isomorphic to the category of sets and relations; a second application yields a category isomorphic to the category of monotonic predicate transformers. This hierarchy cannot be extended further: the category of total functions is not itself an instance of the categorical construction, and can only be extended by it twice.
منابع مشابه
Frame Based Typing of Predicate Transformers
The algebraic relationship between predicates and predicate transformers is considered. A canonical decomposition property of transformers is used to develop a typing mechanism for predicate transformer process models based on the input and output interfaces of the processes. Predicate transformers are typed according to the variables read from or written to by the process described by the pred...
متن کاملRelating Multifunctions and Predicate Transformers through Closure Operators
We study relations between predicate transformers and mul-tifunctions in a topological setting based on closure operators. We give topological deenitions of safety and liveness predicates and using these predicates we deene predicate transformers. State transformers are mul-tifunctions with values in the collection of xed points of a closure operator. We derive several isomorphisms between pred...
متن کاملMixed powerdomains for probability and nondeterminism
We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism. We characterise them as free algebras for suitable (in)equational theories; we establish functional representation theorems; and we show equivalencies between state transformers and appropriately healthy predicate transformers. The extended nonnegative reals serve as ‘truth-values’. As usual with ...
متن کاملPredicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a category enjoying many algebraic properties. We build on this structure to make predicate transformers into a denotational model of full linear logic: all the logical constructions have a natural interpretation in term...
متن کاملA Relation-Algebraic Approach to Multirelations and Predicate Transformers
The correspondence between up-closed multirelations and isotone predicate transformers is well known. Less known is that multirelations have also been used for modelling topological contact, not only computations. We investigate how properties from these two lines of research translate to predicate transformers. To this end, we express the correspondence of multirelations and predicate transfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 22 شماره
صفحات -
تاریخ انتشار 1992